Exact Pair Theorem for the ω-Enumeration Degrees
نویسنده
چکیده
In the paper the exact pair theorem for the ω-enumeration degrees is proved. As a corollary an exact pair theorem involving the jump operation for the enumeration degrees is obtained. Mathematics subject classification: 03D30
منابع مشابه
The Jump Operator on the Ω-enumeration Degrees
The jump operator on the ω-enumeration degrees is introduced in [11]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structureDω ′ of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of Dω ′ and of the enumeration degrees are isomorphic. ...
متن کاملThe high/low hierarchy in the local structure of the ω-enumeration degrees
This paper gives two definability results in the local theory of the ω-enumeration degrees. First we prove that the local structure of the enumeration degrees is first order definable as a substructure of the ω-enumeration degrees. Our second result is the definability of the the classes Hn and Ln of the highn and lown ω-enumeration degrees. This allows us to deduce that the first order theory ...
متن کاملKalimullin Pairs of Σ2 Ω-enumeration Degrees
We study the notion of K-pairs in the local structure of the ωenumeration degrees. We introduce the notion of super almost zero sequences and investigate their structural properties. The study of degree structures has been one of the central themes in computability theory. Although the main focus has been on the structure of the Turing degrees and its local substructure, of the degrees below th...
متن کاملDefinability in the local theory of the ω-enumeration degrees
We continue the study of the local theory of the structure of the ω-enumeration degrees, started by Soskov and Ganchev [7]. We show that the classes of 1-high and 1-low ω-enumeration degrees are definable. We prove that a standard model of arithmetic is definable as well. 1 ω-enumeration degrees In computability theory there is a vast variety of reducibility relations. Informally, the common fe...
متن کاملOn the Symmetric Enumeration Degrees
A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration reducible to B and A is enumeration reducible to B. This reducibility gives rise to a degree structure (Dse) whose least element is the class of computable sets. We give a classification of ≤se in terms of other standard reducibilities and we show that the natural embedding of the Turing degrees (DT) into th...
متن کامل